Core-stateless Guaranteed Throughput Networks
نویسندگان
چکیده
Abstract — End-to-end throughput guarantee is an important service semantics that network providers would like to offer to their customers. A network provider can offer such service semantics by deploying a network where each router employs a fair packet scheduling algorithm. Unfortunately, these scheduling algorithms require every router to maintain per-flow state and perform perpacket flow classification; these requirements limit the scalability of the routers. In this paper, we propose the Core-stateless Guaranteed Throughput (CSGT) network architecture—the first workconserving architecture that, without maintaining per-flow state or performing per-packet flow classification in core routers, provides to flows throughput guarantees that are within an additive constant of what is attained by a network of core-stateful fair routers.
منابع مشابه
Assuring Fair Allocation of Excess Bandwidth in Reservation Based Core-Stateless Networks
Assuring guaranteed services and providing fair bandwidth sharing are much sought characteristics in the current network architecture research. The IntServ approaches achieve those characteristics but only at the expense of using per-flow states and signaling, which are not scalable and difficult to implement. Alternatively, the stateless approaches proposed up to now are focused either on prov...
متن کاملA new traffic model for core-stateless scheduling
similar level of guaranteed services as the stateful approach, while they do not need per-flow management. They hence possess both the properties of Quality-of-Service (QoS) provisioning and high scalability. In this paper, by showing the current existing traffic models are not applicable to core-stateless networks, a new and efficient traffic model for characterizing traffic in a core-stateles...
متن کاملDistributed Admission Control to Support Guaranteed Services in Core-Stateless Networks
The core-stateless service architecture alleviates the scalability problems of the integrated service framework while maintaining its guaranteed service semantics. The admission control methods proposed to support core-stateless guaranteed services have significant drawbacks. We propose a scalable and robust distributed admission control architecture to support corestateless guaranteed services...
متن کاملCore-Stateless Guaranteed Rate Scheduling Algorithms
Many per-flow scheduling algorithms have been proposed to provide rate and delay guarantees to flows. It is often argued that the need for maintaining per-flow state and performing per-packet classification seriously limits the scalability of routers that employ such per-flow scheduling algorithms. Consequently, design of algorithms that can provide per-flow rate and delay guarantees without re...
متن کاملEnhanced core stateless fair queuing with multiple queue priority scheduler
The Core Stateless Fair Queuing (CSFQ) is a distributed approach of Fair Queuing (FQ). The limitations include its inability to estimate fairness during large traffic flows, which are short and bursty (VoIP or video), and also it utilizes the single FIFO queue at the core router. For improving the fairness and efficiency, we propose an Enhanced Core Stateless Fair Queuing (ECSFQ) with multiple ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003